Extended and Improved Criss-Cross Algorithms for Computing the Spectral Value Set Abscissa and Radius
نویسندگان
چکیده
منابع مشابه
Criss-Cross Type Algorithms for Computing the Real Pseudospectral Abscissa
The real ε-pseudospectrum of a real matrix A consists of the eigenvalues of all real matrices that are ε-close in spectral norm to A. The real pseudospectral abscissa, which is the largest real part of these eigenvalues for a prescribed value ε, measures the structured robust stability of A w.r.t. real perturbations. In this report, we introduce a criss-cross type algorithm to compute the real ...
متن کاملNew Algorithms for Computing the Real Structured Pseudospectral Abscissa and the Real Stability Radius of Large and Sparse Matrices
We present two new algorithms for investigating the stability of large and sparse matrices subject to real perturbations. The first algorithm computes the real structured pseudospectral abscissa and is based on the algorithm for computing the pseudospectral abscissa proposed by Guglielmi and Overton [SIAM J. Matrix Anal. Appl., 32 (2011), pp. 1166-1192]. It entails finding the rightmost eigenva...
متن کاملSubspace Methods for Computing the Pseudospectral Abscissa and the Stability Radius
The pseudospectral abscissa and the stability radius are well-established tools for quantifying the stability of a matrix under unstructured perturbations. Based on first-order eigenvalue expansions, Guglielmi and Overton [SIAM J. Matrix Anal. Appl., 32 (2011), pp. 1166-1192] recently proposed a linearly converging iterative method for computing the pseudospectral abscissa. In this paper, we pr...
متن کاملFast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
The ε-pseudospectral abscissa and radius of an n × n matrix are respectively the maximal real part and the maximal modulus of points in its ε-pseudospectrum, defined using the spectral norm. Existing techniques compute these quantities accurately but the cost is multiple singular value decompositions and eigenvalue decompositions of order n, making them impractical when n is large. We present n...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2019
ISSN: 0895-4798,1095-7162
DOI: 10.1137/19m1246213